3-Disjoint gamma interconnection networks
نویسندگان
چکیده
منابع مشابه
Disjoint Paths Multi-stage Interconnection Networks Stability Problem
This research paper emphasizes that the Stable Matching problems are the same as the problems of stable configurations of Multi–stage Interconnection Networks (MIN). The authors have solved the Stability Problem of Existing Regular Gamma Multistage Interconnection Network (GMIN), 3-Disjoint Gamma Multi-stage Interconnection Network (3DGMIN) and 3-Disjoint Path Cyclic Gamma Multi-stage Interconn...
متن کاملOn Stability Problems of Omega and 3-Disjoint Paths Omega Multi-stage Interconnection Networks
The research paper emphasizes that the Stable Matching problems are the same as the problems of stable configurations of Multi–stage Interconnection Networks (MIN). We have discusses the Stability Problems of Existing Regular Omega Multi-stage Interconnection Network (OMIN) and Proposed 3-Disjoint Paths Omega Multi-stage Interconnection Network (3DON) using the approaches and solutions provided...
متن کاملUnpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks
An unpaired many-to-many -disjoint path cover (-DPC) of a graph is a set of disjoint paths joining distinct sources and sinks in which each vertex of is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every -d...
متن کاملDense edge-disjoint embedding of complete binary trees in interconnection networks
Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP ...
متن کاملOne-to-Many Node Disjoint Paths Routing in Gaussian Interconnection Networks - Ver.9 5/15/13
The cores in parallel systems are connected using interconnection networks. In this work, we consider the Gaussian interconnection networks. Unlike meshes and tori, Gaussian interconnection networks are regular grid-like networks with low degree that can accommodate more nodes with less communication latency. We first design an efficient algorithm with a constant time complexity that constructs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems and Software
سال: 2003
ISSN: 0164-1212
DOI: 10.1016/s0164-1212(02)00070-5